Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Building protocol interactive process based on message sequence chart
SHI Wang, YANG Yingjie, TANG Huilin, DONG Lipeng
Journal of Computer Applications    2015, 35 (5): 1373-1378.   DOI: 10.11772/j.issn.1001-9081.2015.05.1373
Abstract508)      PDF (936KB)(550)       Save

In order to effectively master protocol interactive behavior, a method to automatically build protocol interactive process based on message sequence chart was proposed. Firstly, according to the characteristics of the protocol interactive process, the dependency graph was defined to represent the partial order of events in message sequence, and the network flows were converted to dependency graphs. Secondly, the basic message sequences were used to describe protocol interactive behavior fragments, and the basic message sequences were mined by defining event maximum suffix. Finally, the maximum dependency graphs that were found out were connected and merged to build a message sequence chart. The experimental results show that the proposed method has a high accuracy and the built message sequence chart can visually represent the protocol interactive process.

Reference | Related Articles | Metrics
Information aggregation leakage proof model based on assignment partition
XIE Wenchong YANG Yingjie WANG Yongwei DAI Xiangdong
Journal of Computer Applications    2013, 33 (02): 408-416.   DOI: 10.3724/SP.J.1087.2013.00408
Abstract753)      PDF (791KB)(317)       Save
To solve the problems existing in BLP (Bell-LaPadula) model, such as information aggregation leakage, excessive privileges of trusted subject and the deficiency of integrity, with reference to the application requirement of hierarchical file protection, an information aggregation leakage proof model named IALP (Information Aggregation Leakage Proof) was proposed based on assignment partition. First of all, the cause of information aggregation leakage and the current research situation were discussed. Secondly, on the basis of assignments partition, the knowledgeable degree of subject and the information weight of object were quantized, and the relatively trusted subject was proposed. Security axioms and state transition rules were given. Finally, the theoretical proof, application examples and analysis indicate that IALP can control the knowable degree of the subject towards the object set with the aggregation leakage relation, and limits the privilege of trusted subject and enhances the integrity to some extent.
Related Articles | Metrics